#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e6+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL w[maxn],sum[maxn];
LL ksm(LL a,LL k){
   LL res=1;
   while(k>0){
      if(k&1) res=res*a%mod;
      k>>=1;
      a=a*a%mod;
   }
   return res%mod;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++){
    cin>>w[i];
  }
  for(LL i=n;i>=1;i--) sum[i]=sum[i+1]+w[i];
  ///LL ans=(w[1]%mod*ksm(sum[n],mod-2)%mod)%mod;
  LL ans=1;
  for(LL i=n-1;i>=2;i--){
     ans=(ans%mod*w[i]%mod*ksm(sum[i]%mod,mod-2)%mod)%mod;
  }
  cout<<ans<<"\n";
return 0;
}
